منابع مشابه
Congruence Lattices of Congruence Semidistributive Algebras
Nearly twenty years ago, two of the authors wrote a paper on congruence lattices of semilattices [9]. The problem of finding a really useful characterization of congruence lattices of finite semilattices seemed too hard for us, so we went on to other things. Thus when Steve Seif asked one of us at the October 1990 meeting of the AMS in Amherst what we had learned in the meantime, the answer was...
متن کاملCanonical Forms for Unitary Congruence and *Congruence
We use methods of the general theory of congruence and *congruence for complex matrices—regularization and cosquares—to determine a unitary congruence canonical form (respectively, a unitary *congruence canonical form) for complex matrices A such that ĀA (respectively, A) is normal. As special cases of our canonical forms, we obtain—in a coherent and systematic way—known canonical forms for con...
متن کاملDistributive Congruence Lattices of Congruence-permutable Algebras
We prove that every distributive algebraic lattice with at most א1 compact elements is isomorphic to the normal subgroup lattice of some group and to the submodule lattice of some right module. The א1 bound is optimal, as we find a distributive algebraic lattice D with א2 compact elements that is not isomorphic to the congruence lattice of any algebra with almost permutable congruences (hence n...
متن کاملEntropy of Hybrid Censoring Schemes
A hybrid censoring scheme is a mixture of type I and type II censoring schemes. When $n$ items are placed on a life test, the experiment terminates under type I or type II hybrid censoring scheme if either a pre-fixed censoring time T or the rth (1<=r<=n is fixed) failure is first or later observed, respectively. In this paper, we investigate the decomposition of entropy in both hybrid cen...
متن کاملCongruence Types
We introduce a type theoretical framework in which canon ical term rewriting systems can be represented faithfully both from the logical and the computational points of view The framework is based on congruence types a new syntax which combines inductive algebraic and quotient types Congruence types improve on existing work to combine type theories with algebraic rewriting by making explicit th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Mathematics
سال: 2013
ISSN: 0129-167X,1793-6519
DOI: 10.1142/s0129167x13500092